0.13/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.13/0.14 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.13/0.35 % Computer : n027.cluster.edu 0.13/0.35 % Model : x86_64 x86_64 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.35 % Memory : 8042.1875MB 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.35 % CPULimit : 1200 0.13/0.35 % WCLimit : 120 0.13/0.35 % DateTime : Tue Jul 13 11:57:40 EDT 2021 0.13/0.35 % CPUTime : 0.13/0.36 % Number of cores: 8 0.13/0.36 % Python version: Python 3.6.8 0.13/0.36 # Version: 2.6rc1-ho 0.13/0.36 # No SInE strategy applied 0.13/0.36 # Trying AutoSched0 for 59 seconds 59.16/59.36 # AutoSched0-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S070I 59.16/59.36 # and selection function SelectVGNonCR. 59.16/59.36 # 59.16/59.36 # Preprocessing time : 0.030 s 59.16/59.36 # Presaturation interreduction done 59.31/59.52 # No success with AutoSched0 59.31/59.52 # Trying AutoSched1 for 26 seconds 59.36/59.77 # AutoSched1-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN 59.36/59.77 # and selection function PSelectComplexExceptUniqMaxHorn. 59.36/59.77 # 59.36/59.77 # Preprocessing time : 0.014 s 59.36/59.77 # Presaturation interreduction done 59.36/59.77 59.36/59.77 # Proof found! 59.36/59.77 # SZS status Theorem 59.36/59.77 # SZS output start CNFRefutation 59.36/59.77 thf(dpsetconstrSub, conjecture, (dsetconstrEL=>(![X1:$i, X5:$i, X8:$i > $i > $o]:subset @ (dpsetconstr @ X1 @ X5 @ (^[X3:$i, X4:$i]:X8 @ X3 @ X4)) @ (cartprod @ X1 @ X5)<=subsetI2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dpsetconstrSub)). 59.36/59.77 thf(dsetconstrEL, axiom, (dsetconstrEL<=>![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:X2 @ X4))=>in @ X3 @ X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dsetconstrEL)). 59.36/59.77 thf(subsetI2, axiom, (subsetI2<=>![X1:$i, X5:$i]:(![X3:$i]:(in @ X3 @ X1=>in @ X3 @ X5)=>subset @ X1 @ X5)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', subsetI2)). 59.36/59.77 thf(dpsetconstr, axiom, (dpsetconstr)=(^[X1:$i, X5:$i, X6:$i > $i > $o]:dsetconstr @ (cartprod @ X1 @ X5) @ (^[X7:$i]:?[X3:$i]:(in @ X3 @ X1&?[X4:$i]:((in @ X4 @ X5&X6 @ X3 @ X4)&(X7)=(kpair @ X3 @ X4))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dpsetconstr)). 59.36/59.77 thf(c_0_4, plain, ![X4:$i, X3:$i, X8:$i > $i > $o]:(epred3_3 @ X8 @ X3 @ X4<=>X8 @ X3 @ X4), introduced(definition)). 59.36/59.77 thf(c_0_5, plain, ![X4:$i, X2:$i > $o]:(epred2_2 @ X2 @ X4<=>X2 @ X4), introduced(definition)). 59.36/59.77 thf(c_0_6, negated_conjecture, ~((![X1:$i, X2:$i > $o, X3:$i]:(in @ X3 @ (dsetconstr @ X1 @ (epred2_2 @ X2))=>in @ X3 @ X1)=>(![X1:$i, X5:$i]:(![X3:$i]:(in @ X3 @ X1=>in @ X3 @ X5)=>subset @ X1 @ X5)=>![X1:$i, X5:$i, X8:$i > $i > $o]:subset @ (dpsetconstr @ X1 @ X5 @ (epred3_3 @ X8)) @ (cartprod @ X1 @ X5)))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[dpsetconstrSub]), dsetconstrEL]), subsetI2]), c_0_4]), c_0_5])])). 59.36/59.77 thf(c_0_7, negated_conjecture, ![X24:$i, X25:$i > $o, X26:$i, X27:$i, X28:$i]:((~in @ X26 @ (dsetconstr @ X24 @ (epred2_2 @ X25))|in @ X26 @ X24)&(((in @ (esk1_2 @ X27 @ X28) @ X27|subset @ X27 @ X28)&(~in @ (esk1_2 @ X27 @ X28) @ X28|subset @ X27 @ X28))&~subset @ (dpsetconstr @ esk2_0 @ esk3_0 @ (epred3_3 @ epred4_0)) @ (cartprod @ esk2_0 @ esk3_0))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])). 59.36/59.77 thf(c_0_8, plain, ![X18:$i, X1:$i, X5:$i, X6:$i > $i > $o]:(epred1_4 @ X6 @ X5 @ X1 @ X18<=>?[X19:$i]:(in @ X19 @ X1&?[X20:$i]:((in @ X20 @ X5&X6 @ X19 @ X20)&(X18)=(kpair @ X19 @ X20)))), introduced(definition)). 59.36/59.77 thf(c_0_9, negated_conjecture, ![X1:$i, X3:$i, X2:$i > $o]:(in @ X1 @ X3|~in @ X1 @ (dsetconstr @ X3 @ (epred2_2 @ X2))), inference(split_conjunct,[status(thm)],[c_0_7])). 59.36/59.77 thf(c_0_10, negated_conjecture, ![X1:$i, X3:$i]:(in @ (esk1_2 @ X1 @ X3) @ X1|subset @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_7])). 59.36/59.77 thf(c_0_11, plain, ![X1:$i, X5:$i, X6:$i > $i > $o]:(dpsetconstr @ X1 @ X5 @ X6)=(dsetconstr @ (cartprod @ X1 @ X5) @ (epred1_4 @ X6 @ X5 @ X1)), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[dpsetconstr]), c_0_8])). 59.36/59.77 thf(c_0_12, negated_conjecture, ![X1:$i, X3:$i]:(subset @ X1 @ X3|~in @ (esk1_2 @ X1 @ X3) @ X3), inference(split_conjunct,[status(thm)],[c_0_7])). 59.36/59.77 thf(c_0_13, negated_conjecture, ![X1:$i, X2:$i > $o, X3:$i]:(in @ (esk1_2 @ (dsetconstr @ X1 @ (epred2_2 @ X2)) @ X3) @ X1|subset @ (dsetconstr @ X1 @ (epred2_2 @ X2)) @ X3), inference(spm,[status(thm)],[c_0_9, c_0_10])). 59.36/59.77 thf(c_0_14, plain, ![X21:$i, X22:$i, X23:$i > $i > $o]:(dpsetconstr @ X21 @ X22 @ X23)=(dsetconstr @ (cartprod @ X21 @ X22) @ (epred1_4 @ X23 @ X22 @ X21)), inference(variable_rename,[status(thm)],[c_0_11])). 59.36/59.77 thf(c_0_15, negated_conjecture, ![X2:$i > $o, X1:$i]:subset @ (dsetconstr @ X1 @ (epred2_2 @ X2)) @ X1, inference(spm,[status(thm)],[c_0_12, c_0_13])). 59.36/59.77 thf(c_0_16, plain, ![X6:$i > $i > $o, X3:$i, X1:$i]:(dpsetconstr @ X1 @ X3 @ X6)=(dsetconstr @ (cartprod @ X1 @ X3) @ (epred1_4 @ X6 @ X3 @ X1)), inference(split_conjunct,[status(thm)],[c_0_14])). 59.36/59.77 thf(c_0_17, plain, ![X1:$i, X6:$i > $i > $o, X3:$i, X2:$i > $o]:(subset @ (dpsetconstr @ X1 @ X3 @ X6) @ (cartprod @ X1 @ X3)|(epred1_4 @ X6 @ X3 @ X1)!=(epred2_2 @ X2)), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_15, c_0_16])])). 59.36/59.77 thf(c_0_18, plain, ![X2:$i > $o, X6:$i > $i > $o, X3:$i, X1:$i]:(subset @ (dpsetconstr @ X1 @ X3 @ X6) @ (cartprod @ X1 @ X3)|(epred1_4 @ X6 @ X3 @ X1 @ (esk7_4 @ X2 @ X3 @ X6 @ X1))!=(epred2_2 @ X2 @ (esk7_4 @ X2 @ X3 @ X6 @ X1))), inference(neg_ext,[status(thm)],[c_0_17])). 59.36/59.77 thf(c_0_19, plain, ![X45:$i, X46:$i > $o]:((~epred2_2 @ X46 @ X45|X46 @ X45)&(~X46 @ X45|epred2_2 @ X46 @ X45)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])). 59.36/59.77 thf(c_0_20, negated_conjecture, ~subset @ (dpsetconstr @ esk2_0 @ esk3_0 @ (epred3_3 @ epred4_0)) @ (cartprod @ esk2_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_7])). 59.36/59.77 thf(c_0_21, plain, ![X2:$i > $o, X6:$i > $i > $o, X3:$i, X1:$i]:(subset @ (dpsetconstr @ X1 @ X3 @ X6) @ (cartprod @ X1 @ X3)|epred1_4 @ X6 @ X3 @ X1 @ (esk7_4 @ X2 @ X3 @ X6 @ X1)|epred2_2 @ X2 @ (esk7_4 @ X2 @ X3 @ X6 @ X1)), inference(dynamic cnf,[status(thm)],[c_0_18])). 59.36/59.77 thf(c_0_22, plain, ![X2:$i > $o, X1:$i]:(X2 @ X1|~epred2_2 @ X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_19])). 59.36/59.77 thf(c_0_23, negated_conjecture, ![X2:$i > $o]:(epred1_4 @ (epred3_3 @ epred4_0) @ esk3_0 @ esk2_0 @ (esk7_4 @ X2 @ esk3_0 @ (epred3_3 @ epred4_0) @ esk2_0)|epred2_2 @ X2 @ (esk7_4 @ X2 @ esk3_0 @ (epred3_3 @ epred4_0) @ esk2_0)), inference(spm,[status(thm)],[c_0_20, c_0_21])). 59.36/59.77 thf(c_0_24, plain, ![X2:$i > $o]:(epred1_4 @ (epred3_3 @ epred4_0) @ esk3_0 @ esk2_0 @ (esk7_4 @ X2 @ esk3_0 @ (epred3_3 @ epred4_0) @ esk2_0)|X2 @ (esk7_4 @ X2 @ esk3_0 @ (epred3_3 @ epred4_0) @ esk2_0)), inference(spm,[status(thm)],[c_0_22, c_0_23])). 59.36/59.77 thf(c_0_25, plain, ![X2:$i > $o, X6:$i > $i > $o, X3:$i, X1:$i]:(subset @ (dpsetconstr @ X1 @ X3 @ X6) @ (cartprod @ X1 @ X3)|~epred1_4 @ X6 @ X3 @ X1 @ (esk7_4 @ X2 @ X3 @ X6 @ X1)|~epred2_2 @ X2 @ (esk7_4 @ X2 @ X3 @ X6 @ X1)), inference(dynamic cnf,[status(thm)],[c_0_18])). 59.36/59.77 thf(c_0_26, plain, epred1_4 @ (epred3_3 @ epred4_0) @ esk3_0 @ esk2_0 @ (esk7_4 @ (epred1_4 @ (epred3_3 @ epred4_0) @ esk3_0 @ esk2_0) @ esk3_0 @ (epred3_3 @ epred4_0) @ esk2_0), inference(ef,[status(thm)],[c_0_24])). 59.36/59.77 thf(c_0_27, plain, ~epred2_2 @ (epred1_4 @ (epred3_3 @ epred4_0) @ esk3_0 @ esk2_0) @ (esk7_4 @ (epred1_4 @ (epred3_3 @ epred4_0) @ esk3_0 @ esk2_0) @ esk3_0 @ (epred3_3 @ epred4_0) @ esk2_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_20])). 59.36/59.77 thf(c_0_28, plain, ![X2:$i > $o, X1:$i]:(epred2_2 @ X2 @ X1|~X2 @ X1), inference(split_conjunct,[status(thm)],[c_0_19])). 59.36/59.77 thf(c_0_29, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_26])]), ['proof']). 59.36/59.77 # SZS output end CNFRefutation 59.36/59.77 # Proof object total steps : 30 59.36/59.77 # Proof object clause steps : 18 59.36/59.77 # Proof object formula steps : 12 59.36/59.77 # Proof object conjectures : 10 59.36/59.77 # Proof object clause conjectures : 7 59.36/59.77 # Proof object formula conjectures : 3 59.36/59.77 # Proof object initial clauses used : 7 59.36/59.77 # Proof object initial formulas used : 4 59.36/59.77 # Proof object generating inferences : 7 59.36/59.77 # Proof object simplifying inferences : 4 59.36/59.77 # Training examples: 0 positive, 0 negative 59.36/59.77 # Parsed axioms : 12 59.36/59.77 # Removed by relevancy pruning/SinE : 0 59.36/59.77 # Initial clauses : 22 59.36/59.77 # Removed in clause preprocessing : 8 59.36/59.77 # Initial clauses in saturation : 14 59.36/59.77 # Processed clauses : 1243 59.36/59.77 # ...of these trivial : 0 59.36/59.77 # ...subsumed : 556 59.36/59.77 # ...remaining for further processing : 687 59.36/59.77 # Other redundant clauses eliminated : 72 59.36/59.77 # Clauses deleted for lack of memory : 0 59.36/59.77 # Backward-subsumed : 0 59.36/59.77 # Backward-rewritten : 0 59.36/59.77 # Generated clauses : 16875 59.36/59.77 # ...of the previous two non-trivial : 16763 59.36/59.77 # Contextual simplify-reflections : 0 59.36/59.77 # Paramodulations : 16674 59.36/59.77 # Factorizations : 2 59.36/59.77 # NegExts : 44 59.36/59.77 # Equation resolutions : 72 59.36/59.77 # Propositional unsat checks : 0 59.36/59.77 # Propositional check models : 0 59.36/59.77 # Propositional check unsatisfiable : 0 59.36/59.77 # Propositional clauses : 0 59.36/59.77 # Propositional clauses after purity: 0 59.36/59.77 # Propositional unsat core size : 0 59.36/59.77 # Propositional preprocessing time : 0.000 59.36/59.77 # Propositional encoding time : 0.000 59.36/59.77 # Propositional solver time : 0.000 59.36/59.77 # Success case prop preproc time : 0.000 59.36/59.77 # Success case prop encoding time : 0.000 59.36/59.77 # Success case prop solver time : 0.000 59.36/59.77 # Current number of processed clauses : 664 59.36/59.77 # Positive orientable unit clauses : 7 59.36/59.77 # Positive unorientable unit clauses: 0 59.36/59.77 # Negative unit clauses : 2 59.36/59.77 # Non-unit-clauses : 655 59.36/59.77 # Current number of unprocessed clauses: 15548 59.36/59.77 # ...number of literals in the above : 52643 59.36/59.77 # Current number of archived formulas : 0 59.36/59.77 # Current number of archived clauses : 22 59.36/59.77 # Clause-clause subsumption calls (NU) : 109924 59.36/59.77 # Rec. Clause-clause subsumption calls : 64806 59.36/59.77 # Non-unit clause-clause subsumptions : 556 59.36/59.77 # Unit Clause-clause subsumption calls : 11 59.36/59.77 # Rewrite failures with RHS unbound : 0 59.36/59.77 # BW rewrite match attempts : 15 59.36/59.77 # BW rewrite match successes : 0 59.36/59.77 # Condensation attempts : 0 59.36/59.77 # Condensation successes : 0 59.36/59.77 # Termbank termtop insertions : 633849 59.36/59.77 59.36/59.77 # ------------------------------------------------- 59.36/59.77 # User time : 58.319 s 59.36/59.77 # System time : 1.096 s 59.36/59.77 # Total time : 59.415 s 59.36/59.77 # Maximum resident set size: 1656 pages 59.36/59.77 EOF